Information Theory Tutorial Communication over Channels with memory
نویسنده
چکیده
A general capacity formula C = sup X I(X; Y), which is correct for arbitrary single-user channels without feedback, is introduced in this tutorial. This new capacity formula is obtained by using a general channel model without any assumptions of the channel, introducing the notion of inf/sup-information/entropy rates, and finding a new tight converse bound on the error probability. In Section 1 we will show the error of the conventional channel capacity formula. Then in section2, we will give some definitions used in the proofs of the capacity formula. Section 3 is devoted to the direct coding theorem. Section 4 will focus on the new converse bound and the general capacity formula. We will see some useful results of the new converse bound in section 5. In section 6, we will see how feedback can increase the channel capacity when the channel has memory.
منابع مشابه
Game theory and the frequency selective interference channel - A tutorial
This paper provides a tutorial overview of game theoretic techniques used for communication over frequency selective interference channels. We discuss both competitive and cooperative techniques.
متن کاملUniversal Communication - Part II: Channels With Memory
Consider communication over a channel whose probabilistic model is completely unknown vector-wise and is not assumed to be stationary. Communication over such channels is challenging because knowing the past does not indicate anything about the future. The existence of reliable feedback and common randomness is assumed. In a previous paper it was shown that the Shannon capacity cannot be attain...
متن کاملOn the role of entanglement in quantum information
We give a tutorial review on the role of entanglement of quantum systems in some tasks of quantum information theory and describe in particular how it can be exploited to achieve secure communication channels. c © 2004 Elsevier B.V. All rights reserved. PACS: 03.67.−a; 42.50.Dv; 89.70.+c
متن کاملOn Quantum Capacity of Compound Channels
In this paper we address the issue of universal or robust communication over quantum channels. Specifically, we consider memoryless communication scenario with channel uncertainty which is an analog of compound channel in classical information theory. We determine the quantum capacity of finite compound channels and arbitrary compound channels with informed decoder. Our approach in the finite c...
متن کاملMismatched decoding revisited: General alphabets, channels with memory, and the wide-band limit
The mismatch capacity of a channel is the highest rate at which reliable communication is possible over the channel with a given (possibly suboptimal) decoding rule. This quantity has been studied extensively for single-letter decoding rules over discrete memoryless channels (DMCs). Here we extend the study to memoryless channels with general alphabets and to channels with memory with possibly ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005